Optimal routing with failure-independent path protection
نویسندگان
چکیده
منابع مشابه
Optimal routing with failure-independent path protection
Reliable communication has become crucial in today’s information society. Modern communication networks are required to deliver reliable communication to their customers. Unfortunately, protection against network failures significantly hampers efficient utilization of network investments, because the associated routing problems become much harder. In this article we present a rigorous mathemati...
متن کاملOptimal Routing with Single Backup Path Protection
Today’s information society relies increasingly on advanced communication networks. This has lead to massive investments in increased communication network capacity. In order to utilize these investments the network operators perform traffic engineering, i.e., route communication in order to maximize the utilization of the capital invested in the communication network. Here we will consider tra...
متن کاملOptimal Path Selection Routing Protocol in MANETs
An Ad hoc network is a collection of mobile nodes forming a temporary network without the help of any centralized access point or existing infrastructure. In such an environment, routing protocols are required to transfer packets from source to destination as some mobile nodes can act as intermediate nodes to forward a packet to its destination, due to the limited range of each mobile node’s wi...
متن کاملA Study of Path Protection in Self-Healing Routing
Recent routing failure accidents show that routing systems are not so stable as we estimated because most of accidents caused packet delivery failure in Internet. In order to resolve this problem, many fast reroute solutions are proposed to guarantee reroute path provision after network failures without high packet loss. However, most of these solutions are not deployed in practice, and some ke...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2009
ISSN: 0028-3045
DOI: 10.1002/net.20323